Symmetry Breaking Predicates for SAT-based DFA Identification

BFS-Based Symmetry Breaking Predicates for DFA Identification

Breaking Symmetries in SAT Matrix Models

Symmetry occurs naturally in many computational problems. The use of symmetry breaking techniques for solving search problems reduces the search space and therefore is expected to reduce the search time. Recent advances in breaking symmetries in SAT models are mainly focused on the identification of permutable variables via graph automorphism. These symmetries are denoted as instance-dependent,...

Symmetry Breaking for Maximum Satisfiability

Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking predicates (SBPs) is a well-known, often effective, technique for solving hard problems. The identification of SBPs in SAT has been the subject of significant improvements in recent years, resulting in more compact SBPs a...

Expressing Symmetry Breaking in DRAT Proofs

An effective SAT preprocessing technique is using symmetrybreaking predicates, i.e., auxiliary clauses that guide a solver away from needless exploration of isomorphic sub-problems. Although symmetrybreaking predicates have been in use for over a decade, it was not known how to express them in proofs of unsatisfiability. Consequently, results obtained by symmetry breaking cannot be validated by...

Speeding up SAT solver by exploring CNF symmetries : Revisited

Boolean Satisfiability solvers have gone through dramatic improvements in their performances and scalability over the last few years by considering symmetries. It has been shown that by using graph symmetries and generating symmetry breaking predicates (SBPs) it is possible to break symmetries in Conjunctive Normal Form (CNF). The SBPs cut down the search space to the nonsymmetric regions of th...